The Procrustes Problem for Orthogonal Stiefel Matrices
نویسندگان
چکیده
منابع مشابه
The Procrustes Problem for Orthogonal Stiefel Matrices
In this paper we consider the Procrustes problem on the manifold of orthogonal Stiefel matrices. Given matrices A 2 R mk , B 2 R mp , m p k, we seek the minimum of kA?BQk 2 for all matrices Q 2 R pk , Q T Q = I kk. We introduce a class of relaxation methods for generating minimizing sequences and ooer a geometric interpretation of these methods. Results of numerical experiments illustrating the...
متن کاملOn a sub-Stiefel Procrustes problem arising in computer vision
In this paper we consider a Procrustes problem on the set of sub-Stiefel matrices. A sub-Stiefel matrix is a matrix that results from deleting simultaneously the last row and the last column of an orthogonal matrix. An iterative algorithm for computing the solution of the sub-Stiefel Procrustes problem is proposed. For these purposes we investigate the properties of sub-Stiefel matrices. We als...
متن کاملUncertainty characterization of the orthogonal Procrustes problem with arbitrary covariance matrices
This paper addresses the weighted orthogonal Procrustes problem of matching stochastically perturbed point clouds, formulated as an optimization problem with a closed-form solution. A novel uncertainty characterization of the solution of this problem is proposed resorting to perturbation theory concepts, which admits arbitrary transformations between point clouds and individual covariance and c...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe inverse eigenvalue problem via orthogonal matrices
In this paper we study the inverse eigenvalue problem for symmetric special matrices and introduce sufficient conditions for obtaining nonnegative matrices. We get the HROU algorithm from [1] and introduce some extension of this algorithm. If we have some eigenvectors and associated eigenvalues of a matrix, then by this extension we can find the symmetric matrix that its eigenvalue and eigenvec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 1999
ISSN: 1064-8275,1095-7197
DOI: 10.1137/s106482759630992x